n,m=map(int,input().split())
a,b=map(int,input().split())
mn=a/b*m
for i in range(n-1):
a,b=map(int,input().split())
c=a/b*m
if(c<mn):
mn=c
print(mn)#include <bits/stdc++.h>
using namespace std;
int main ()
{
int n,m; cin >> n >> m;
double kilo = 0x3f3f3f3f;
int a, b;
for (int i = 0; i < n; i++)
{
cin >> a >> b;
kilo = min (kilo , (double)a/b);
}
printf ("%.8f",kilo*m);
return 0;
}
96A - Football | 702B - Powers of Two |
1036A - Function Height | 443A - Anton and Letters |
1478B - Nezzar and Lucky Number | 228A - Is your horseshoe on the other hoof |
122A - Lucky Division | 1611C - Polycarp Recovers the Permutation |
432A - Choosing Teams | 758A - Holiday Of Equality |
1650C - Weight of the System of Nested Segments | 1097A - Gennady and a Card Game |
248A - Cupboards | 1641A - Great Sequence |
1537A - Arithmetic Array | 1370A - Maximum GCD |
149A - Business trip | 34A - Reconnaissance 2 |
59A - Word | 462B - Appleman and Card Game |
1560C - Infinity Table | 1605C - Dominant Character |
1399A - Remove Smallest | 208A - Dubstep |
1581A - CQXYM Count Permutations | 337A - Puzzles |
495A - Digital Counter | 796A - Buying A House |
67A - Partial Teacher | 116A - Tram |